#SAT Algorithms from Shrinkage
نویسنده
چکیده
We present a deterministic algorithm that counts the number of satisfying assignments for any de Morgan formula F of size at most n3−16ε in time 2n−n ε · poly(n), for any small constant ε > 0. We do this by derandomizing the randomized algorithm mentioned by Komargodski et al. (FOCS, 2013) and Chen et al. (CCC, 2014). Our result uses the tight “shrinkage in expectation” result of de Morgan formulas by H̊astad (SICOMP, 1998) as a black-box, and improves upon the result of Chen et al. (MFCS, 2014) that gave deterministic counting algorithms for de Morgan formulas of size at most n. Our algorithm generalizes to other bases of Boolean gates giving a 2n−n ε · poly(n) time counting algorithm for formulas of size at most nΓ+1−O(ε), where Γ is the shrinkage exponent for formulas using gates from the basis. ∗Weizmann Institute of Science, Rehovot, Israel. [email protected]. Supported by an Adams Fellowship of the Israel Academy of Sciences and Humanities, by an ISF grant and by the I-CORE Program of the Planning and Budgeting Committee. ISSN 1433-8092 Electronic Colloquium on Computational Complexity, Report No. 114 (2015)
منابع مشابه
T C C C
I discuss recent progress in developing and exploiting connections between SAT algorithms and circuit lower bounds. The centrepiece of the article is Williams’ proof that NEXP * ACC0, which proceeds via a new algorithm for ACC0-SAT beating brute-force search. His result exploits a formal connection from non-trivial SAT algorithms to circuit lower bounds. I also discuss various connections in th...
متن کاملRandomized Algorithm For 3-Set Splitting Problem and it's Markovian Model
In this paper we restrict every set splitting problem to the special case in which every set has just three elements. This restricted version is also NP-complete. Then, we introduce a general conversion from any set splitting problem to 3-set splitting. Then we introduce a randomize algorithm, and we use Markov chain model for run time complexity analysis of this algorithm. In the last section ...
متن کاملIronic Complicity: Satisfiability Algorithms and Circuit Lower Bounds
I discuss recent progress in developing and exploiting connections between SAT algorithms and circuit lower bounds. The centrepiece of the article is Williams’ proof that NEXP 6⊆ ACC, which proceeds via a new algorithm for ACC-SAT beating brute-force search. His result exploits a formal connection from non-trivial SAT algorithms to circuit lower bounds. I also discuss various connections in the...
متن کاملWorst-Case Upper Bounds
There are many algorithms for testing satisfiability — how to evaluate and compare them? It is common (but still disputable) to identify the efficiency of an algorithm with its worst-case complexity. From this point of view, asymptotic upper bounds on the worst-case running time and space is a criterion for evaluation and comparison of algorithms. In this chapter we survey ideas and techniques ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Electronic Colloquium on Computational Complexity (ECCC)
دوره 22 شماره
صفحات -
تاریخ انتشار 2015